A strict error bound with separated contributions of the discretization and of the iterative solver in non-overlapping domain decomposition methods
نویسندگان
چکیده
This paper deals with the estimation of the distance between the solution of a static linear mechanic problem and its approximation by the finite element method solved with a non-overlapping domain decomposition method (FETI or BDD). We propose a new strict upper bound of the error which separates the contribution of the iterative solver and the contribution of the discretization. Numerical assessments show that the bound is sharp and enables us to define an objective stopping criterion for the iterative solver.
منابع مشابه
Strict lower bounds with separation of sources of error in non-overlapping domain decomposition methods
This article deals with the computation of guaranteed lower bounds of the error in the framework of finite element (FE) and domain decomposition (DD) methods. In addition to a fully parallel computation, the proposed lower bounds separate the algebraic error (due to the use of a DD iterative solver) from the discretization error (due to the FE), which enables the steering of the iterative solve...
متن کاملCoupling Nonlinear Element Free Galerkin and Linear Galerkin Finite Volume Solver for 2D Modeling of Local Plasticity in Structural Material
This paper introduces a computational strategy to collaboratively develop the Galerkin Finite Volume Method (GFVM) as one of the most straightforward and efficient explicit numerical methods to solve structural problems encountering material nonlinearity in a small limited area, while the remainder of the domain represents a linear elastic behavior. In this regard, the Element Free Galerkin met...
متن کاملStrict bounding of quantities of interest in computations based on domain decomposition
This paper deals with bounding the error on the estimation of quantities of interest obtained by finite element and domain decomposition methods. The proposed bounds are written in order to separate the two errors involved in the resolution of reference and adjoint problems : on the one hand the discretization error due to the finite element method and on the other hand the algebraic error due ...
متن کاملNumerical Experiments With an Overlapping Additive Schwarz Solver for 3-d pArallel Reservoir Simulation
Domain decomposition methods are a major area of contemporary research in numerical analysis of partial diierential equations. They provide robust, parallel and scalable preconditioned iterative methods for the large linear systems arising when continuous problems are discretized by nite elements, nite diierences or spectral methods. This paper presents some numerical experiments on a distribut...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...
متن کامل